Quality of Service Routing

نویسندگان

  • Piet Van Mieghem
  • Fernando A. Kuipers
  • Turgay Korkmaz
  • Marwan Krunz
  • Marília Curado
  • Edmundo Monteiro
  • Xavier Masip-Bruin
  • Josep Solé-Pareta
  • Sergio Sánchez-López
چکیده

Constraint-based routing is an invaluable part of a full-fledged Quality of Service architecture. Unfortunately, QoS routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The need for such algorithms has resulted in the proposal of numerous heuristics and a few exact solutions. This chapter presents a thorough, concise, and fair evaluation of the most important multi-constrained path selection algorithms known today. A performance evaluation of these algorithms is presented based on a complexity analysis and simulation results. Besides the routing algorithm, dynamic aspects of QoS routing are discussed: how to cope with incomplete or inaccurate topology information and (in)stability issues.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Success Ratio in Multi-Constraint Quality of Service Routing

Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...

متن کامل

Improving Quality of Service Routing in Mobile Ad Hoc Networks Using OLSR

Mobile ad hoc networks (MANET) are constructed by mobile nodes without access point. Since MANET has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. The OLSR protocol is an optimization of the classical link state algorithm. OLSR introduces an interesting concept, the multipoint r...

متن کامل

Discussion And Review In Vanet

VANET are becoming active area of research and devel- opment because it has potential to increase road safety, convenience and comfort to drivers & passengers. A Lot of research work on VANET have done in area of Quali- ty of Service (QoS), routing and security. These concepts relate the facing challenges for technology in VANET. We present a overview of challenges in VANET. Firstly ,we have di...

متن کامل

Discussion And Review In Vanet

VANET are becoming active area of research and devel- opment because it has potential to increase road safety, convenience and comfort to drivers & passengers. A Lot of research work on VANET have done in area of Quali- ty of Service (QoS), routing and security. These concepts relate the facing challenges for technology in VANET. We present a overview of challenges in VANET. Firstly ,we have di...

متن کامل

Improving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks

Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...

متن کامل

The Bi-Objective Location-Routing Problem based on Simultaneous Pickup and Delivery with Soft Time Window

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003